全文获取类型
收费全文 | 1975篇 |
免费 | 245篇 |
国内免费 | 83篇 |
专业分类
化学 | 765篇 |
晶体学 | 8篇 |
力学 | 142篇 |
综合类 | 31篇 |
数学 | 806篇 |
物理学 | 551篇 |
出版年
2023年 | 28篇 |
2022年 | 62篇 |
2021年 | 108篇 |
2020年 | 78篇 |
2019年 | 53篇 |
2018年 | 53篇 |
2017年 | 96篇 |
2016年 | 97篇 |
2015年 | 73篇 |
2014年 | 135篇 |
2013年 | 139篇 |
2012年 | 97篇 |
2011年 | 119篇 |
2010年 | 87篇 |
2009年 | 113篇 |
2008年 | 137篇 |
2007年 | 117篇 |
2006年 | 100篇 |
2005年 | 48篇 |
2004年 | 79篇 |
2003年 | 52篇 |
2002年 | 46篇 |
2001年 | 44篇 |
2000年 | 49篇 |
1999年 | 48篇 |
1998年 | 23篇 |
1997年 | 23篇 |
1996年 | 22篇 |
1995年 | 21篇 |
1994年 | 15篇 |
1993年 | 19篇 |
1992年 | 16篇 |
1991年 | 6篇 |
1990年 | 8篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1987年 | 8篇 |
1986年 | 6篇 |
1985年 | 10篇 |
1984年 | 9篇 |
1983年 | 9篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 9篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有2303条查询结果,搜索用时 531 毫秒
1.
2.
Thalia Tsiaka Panagiotis Zoumpoulakis Vassilia J. Sinanoglou Constantinos Makris Georgios A. Heropoulos Antony C. Calokerinos 《Analytica chimica acta》2015
High-energy assisted extraction techniques, like ultrasound assisted extraction (UAE) and microwave assisted extraction (MAE), are widely applied over the last years for the recovery of bioactive compounds such as carotenoids, antioxidants and phenols from foods, animals and herbal natural sources. Especially for the case of xanthophylls, the main carotenoid group of crustaceans, they can be extracted in a rapid and quantitative way with the use of UAE and MAE. 相似文献
3.
Recursive algorithms for the computation of standard deviation and average deviation are derived and their applications in data acquisition are discussed. The relative speeds and accuracies of the two algorithms are compared for synthetic data. The performance of recursive estimation under shot and proportional noise limitations is also described. As an example of the utility of these algorithms, absorbance data with constant confidence intervals are collected regardless of incident and transmitted intensities. The desired precision is specified prior to data acquisition and used to control signal-averaging of the data in real time. 相似文献
4.
The propagation property of flattened Gaussian beams (FGBs) is studied based on the Collins formula, and analytical propagation equations for FGBs with and without an aperture are derived. It is shown that the closed-form expressions for the FGB of order N passing through paraxial ABCD optical systems without an aperture can be written as the combinations of Confluent Hyper-geometric Functions, and that the analytical equations for the FGB of order N passing through apertured paraxial ABCD optical systems may involve Error Functions. The proposed algorithms for the considered beams can save computing time, provide intuitive physical insights, and help to design optical systems. Our results are confirmed and illustrated with numerical examples. 相似文献
5.
模糊关系矩阵传递闭包的Warshall算法 总被引:8,自引:2,他引:6
通过对照关系的传递闭包和模糊关系的传递闭包,把求关系矩阵的传递闭包的算法完整地推广到模糊关系矩阵上。 相似文献
6.
Based on the beam coherence-polarization (BCP) matrix, the polarization property of coherent and incoherent Gaussian beam combinations is studied in detail. The general expressions for the degree of polarization P of the resulting beam in case of incoherent and coherent combinations are derived. It is shown that P is dependent on the incoherent or coherent combination, propagation distance, separation, azimuth of the polarization plane and numbers of beamlets in general. The irradiance distribution of the resulting beam for the coherent cases depends on the azimuth of the polarization plane of beamlets. However, for the incoherent case it does not. 相似文献
7.
本文研究了具有三角形波基函数的Bernstein-Fan值算子的收敛定理和逼近阶估计,并给出了它的算法程序。 相似文献
8.
J.-L. Hainaut V. Englebert J. Henrard J.-M. Hick D. Roland 《Applied Categorical Structures》1996,3(1-2):9-45
This paper analyzes the requirements that CASE tools should meet for effective database reverse engineering (DBRE), and proposes
a general architecture for data-centered applications reverse engineering CASE environments. First, the paper describes a
generic DBMS-independent DBRE methodology, then it analyzes the main characteristics of DBRE activities in order to collect
a set of desirable requirements. Finally, it describes DB-MAIN, an operational CASE tool developed according to these requirements.
The main features of this tool that are described in this paper are its unique generic specification model, its repository,
its transformation toolkit, its user interface, the text processors, the assistants, the methodological control and its functional
extensibility. Finally, the paper describes five real-world projects in which the methodology and the CASE tool were applied.
This is a heavily revised and extended version of “Requirements for Information System Reverse Engineering Support” by J.-L.
Hainaut, V. Englebert, J. Henrard, J.-M. Hick, D. Roland, which first appeared in the Proceedings of the Second Working Conference
on Reverse Engineering, IEEE Computer Society Press, pp. 136–145, July 1995. This paper presents some results of the DB-MAIN
project. This project is partially supported by the Région Wallonne, the European Union, and by a consortium comprising ACEC-OSI (Be), ARIANE-II (Be), Banque UCL (Lux), BBL (Be), Centre de recherche public H.
Tudor (Lux), CGER (Be), Cockerill-Sambre (Be), CONCIS (Fr), D'Ieteren (Be), DIGITAL, EDF (Fr), EPFL (CH), Groupe S (Be), IBM,
OBLOG Software (Port), ORIGIN (Be), Ville de Namur (Be), Winterthur (Be), 3 Suisses (Be). The DB-Process subproject is supported
by the Communauté Fran?aise de Belgique. 相似文献
9.
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon. 相似文献
10.
M.V. Devyaterikova 《Operations Research Letters》2006,34(2):149-154
In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed. 相似文献